Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Codes and designs [[electronic resource] ] : proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, May 18-21, 2000 / / editors, K.T. Arasu, A. Seress
| Codes and designs [[electronic resource] ] : proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, May 18-21, 2000 / / editors, K.T. Arasu, A. Seress |
| Edizione | [Reprint 2012] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Walter de Gruyter, 2002 |
| Descrizione fisica | 1 online resource (332 p.) |
| Disciplina | 003/.54 |
| Altri autori (Persone) |
Ray-ChaudhuriDijen <1933->
ArasuK. T. <1954-> SeressÁkos <1958-> |
| Collana | Ohio State University Mathematical Research Institute publications |
| Soggetto topico |
Coding theory
Combinatorial designs and configurations |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-282-19436-4
9786612194368 3-11-019811-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Preface -- Table of contents -- Highlights of Dijen Ray-Chaudhuri's research / Seress, Ákos -- On the ρ-ranks of GMW difference sets / Arasu, Κ. T. / Hollmann, Henk D. L. / Player, Kevin / Xiang, Qing -- Characterization of maximal rational circulant association schemes / Bang, Sejeong / Song, Sung-Yell -- Face-regular polyhedra and tilings with two combinatorial types of faces / Deza, Michel -- Geometry, codes and difference sets: exceptional connections / Dillon, J. F. -- A singular direct product for bicolorable Steiner triple systems / Dinitz, Jeffrey H. / Stinson, Douglas R. -- On semi-regular relative difference sets in non-abelian ρ-groups / Elvira, Dominic / Hiramine, Yutaka -- Every λ-design on 6ρ + 1 points is type-1 / Fiala, Nick C. -- An introduction to balanced network flows / Fremuth-Paeger, Christian / Jungnickel, Dieter -- On the λ-design conjecture for ν = 5ρ + 1 points / Hein, Derek W. / Ionin, Yury J. -- On a class of twin balanced incomplete block designs / Kharaghani, Hadi / Tonchev, Vladimir D. -- Decoding some doubly-even self-dual [32,16, 8] codes by hand / Kim, Jon-Lark / Pless, Vera -- On the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size / Kreher, Donald L. / Rees, Rolf S. -- On a family of cocyclic Hadamard matrices / Launey, Warwick de -- A mass formula for Type II codes over finite fields of characteristic two / Munemasa, Akihiro -- A posteriori probability decoding through the discrete Fourier transform and the dual code / Schram, Erin J. -- Subdesigns of symmetric designs / Shrikhande, Mohan S. -- Linear codes over F2 + u F2 and their complete weight enumerators / Siap, Irfan -- On single-deletion-correcting codes / Sloane, N. J. A. -- Critical problems in finite vector spaces / Wan, Zhe-Xian -- Existence of Steiner systems that admit automorphisms with large cycles / Wilson, Richard M. -- Rainbow graphs / Woldar, Andrew J. |
| Record Nr. | UNINA-9910451465603321 |
| Berlin ; ; New York, : Walter de Gruyter, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Codes and designs [[electronic resource] ] : proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, May 18-21, 2000 / / editors, K.T. Arasu, A. Seress
| Codes and designs [[electronic resource] ] : proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, May 18-21, 2000 / / editors, K.T. Arasu, A. Seress |
| Edizione | [Reprint 2012] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Walter de Gruyter, 2002 |
| Descrizione fisica | 1 online resource (332 p.) |
| Disciplina | 003/.54 |
| Altri autori (Persone) |
Ray-ChaudhuriDijen <1933->
ArasuK. T. <1954-> SeressÁkos <1958-> |
| Collana | Ohio State University Mathematical Research Institute publications |
| Soggetto topico |
Coding theory
Combinatorial designs and configurations |
| ISBN |
1-282-19436-4
9786612194368 3-11-019811-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Preface -- Table of contents -- Highlights of Dijen Ray-Chaudhuri's research / Seress, Ákos -- On the ρ-ranks of GMW difference sets / Arasu, Κ. T. / Hollmann, Henk D. L. / Player, Kevin / Xiang, Qing -- Characterization of maximal rational circulant association schemes / Bang, Sejeong / Song, Sung-Yell -- Face-regular polyhedra and tilings with two combinatorial types of faces / Deza, Michel -- Geometry, codes and difference sets: exceptional connections / Dillon, J. F. -- A singular direct product for bicolorable Steiner triple systems / Dinitz, Jeffrey H. / Stinson, Douglas R. -- On semi-regular relative difference sets in non-abelian ρ-groups / Elvira, Dominic / Hiramine, Yutaka -- Every λ-design on 6ρ + 1 points is type-1 / Fiala, Nick C. -- An introduction to balanced network flows / Fremuth-Paeger, Christian / Jungnickel, Dieter -- On the λ-design conjecture for ν = 5ρ + 1 points / Hein, Derek W. / Ionin, Yury J. -- On a class of twin balanced incomplete block designs / Kharaghani, Hadi / Tonchev, Vladimir D. -- Decoding some doubly-even self-dual [32,16, 8] codes by hand / Kim, Jon-Lark / Pless, Vera -- On the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size / Kreher, Donald L. / Rees, Rolf S. -- On a family of cocyclic Hadamard matrices / Launey, Warwick de -- A mass formula for Type II codes over finite fields of characteristic two / Munemasa, Akihiro -- A posteriori probability decoding through the discrete Fourier transform and the dual code / Schram, Erin J. -- Subdesigns of symmetric designs / Shrikhande, Mohan S. -- Linear codes over F2 + u F2 and their complete weight enumerators / Siap, Irfan -- On single-deletion-correcting codes / Sloane, N. J. A. -- Critical problems in finite vector spaces / Wan, Zhe-Xian -- Existence of Steiner systems that admit automorphisms with large cycles / Wilson, Richard M. -- Rainbow graphs / Woldar, Andrew J. |
| Record Nr. | UNINA-9910782192303321 |
| Berlin ; ; New York, : Walter de Gruyter, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Codes and designs [[electronic resource] ] : proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, May 18-21, 2000 / / editors, K.T. Arasu, A. Seress
| Codes and designs [[electronic resource] ] : proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday, The Ohio State University, May 18-21, 2000 / / editors, K.T. Arasu, A. Seress |
| Edizione | [Reprint 2012] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Walter de Gruyter, 2002 |
| Descrizione fisica | 1 online resource (332 p.) |
| Disciplina | 003/.54 |
| Altri autori (Persone) |
Ray-ChaudhuriDijen <1933->
ArasuK. T. <1954-> SeressÁkos <1958-> |
| Collana | Ohio State University Mathematical Research Institute publications |
| Soggetto topico |
Coding theory
Combinatorial designs and configurations |
| ISBN |
1-282-19436-4
9786612194368 3-11-019811-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Preface -- Table of contents -- Highlights of Dijen Ray-Chaudhuri's research / Seress, Ákos -- On the ρ-ranks of GMW difference sets / Arasu, Κ. T. / Hollmann, Henk D. L. / Player, Kevin / Xiang, Qing -- Characterization of maximal rational circulant association schemes / Bang, Sejeong / Song, Sung-Yell -- Face-regular polyhedra and tilings with two combinatorial types of faces / Deza, Michel -- Geometry, codes and difference sets: exceptional connections / Dillon, J. F. -- A singular direct product for bicolorable Steiner triple systems / Dinitz, Jeffrey H. / Stinson, Douglas R. -- On semi-regular relative difference sets in non-abelian ρ-groups / Elvira, Dominic / Hiramine, Yutaka -- Every λ-design on 6ρ + 1 points is type-1 / Fiala, Nick C. -- An introduction to balanced network flows / Fremuth-Paeger, Christian / Jungnickel, Dieter -- On the λ-design conjecture for ν = 5ρ + 1 points / Hein, Derek W. / Ionin, Yury J. -- On a class of twin balanced incomplete block designs / Kharaghani, Hadi / Tonchev, Vladimir D. -- Decoding some doubly-even self-dual [32,16, 8] codes by hand / Kim, Jon-Lark / Pless, Vera -- On the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size / Kreher, Donald L. / Rees, Rolf S. -- On a family of cocyclic Hadamard matrices / Launey, Warwick de -- A mass formula for Type II codes over finite fields of characteristic two / Munemasa, Akihiro -- A posteriori probability decoding through the discrete Fourier transform and the dual code / Schram, Erin J. -- Subdesigns of symmetric designs / Shrikhande, Mohan S. -- Linear codes over F2 + u F2 and their complete weight enumerators / Siap, Irfan -- On single-deletion-correcting codes / Sloane, N. J. A. -- Critical problems in finite vector spaces / Wan, Zhe-Xian -- Existence of Steiner systems that admit automorphisms with large cycles / Wilson, Richard M. -- Rainbow graphs / Woldar, Andrew J. |
| Record Nr. | UNINA-9910811832103321 |
| Berlin ; ; New York, : Walter de Gruyter, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Permutation group algorithms / A. Seress
| Permutation group algorithms / A. Seress |
| Autore | Seress, Akos <1958- > |
| Pubbl/distr/stampa | Cambridge : Cambridge University, c2003 |
| Descrizione fisica | ix, 264 p. ; 24 cm |
| Disciplina | 512.2 |
| Collana | Cambridge tracts in mathematics |
| Soggetto non controllato |
Algoritmi
Gruppi di permutazione |
| ISBN | 0-521-66103-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990003984900403321 |
Seress, Akos <1958- >
|
||
| Cambridge : Cambridge University, c2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Permutation group algorithms / Akos Seress
| Permutation group algorithms / Akos Seress |
| Autore | Seress, Akos |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 2003 |
| Descrizione fisica | IX, 264 p. ; 24 cm. |
| Soggetto topico |
20-XX - Group theory and generalizations [MSC 2020]
68W30 - Symbolic computation and algebraic computation [MSC 2020] 68Q25 - Analysis of algorithms and problem complexity [MSC 2020] 68W40 - Analysis of algorithms [MSC 2020] 20F05 - Generators, relations, and presentations of groups [MSC 2020] 20-08 - Computational methods for problems pertaining to group theory [MSC 2020] |
| ISBN | 978-05-216-6103-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0051399 |
|
Seress, Akos
|
||
| Cambridge, : Cambridge university, 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Permutation group algorithms / / Ákos Seress [[electronic resource]]
| Permutation group algorithms / / Ákos Seress [[electronic resource]] |
| Autore | Seress Ákos <1958-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2003 |
| Descrizione fisica | 1 online resource (ix, 264 pages) : digital, PDF file(s) |
| Disciplina | 512/.2 |
| Collana | Cambridge tracts in mathematics |
| Soggetto topico |
Permutation groups
Algorithms |
| ISBN |
1-107-12840-4
1-280-41763-3 9786610417636 1-139-14616-5 0-511-16962-0 0-511-06647-3 0-511-06016-5 0-511-30845-0 0-511-54654-8 0-511-06860-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups. |
| Record Nr. | UNINA-9910450522603321 |
|
Seress Ákos <1958->
|
||
| Cambridge : , : Cambridge University Press, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Permutation group algorithms / Akos Seress
| Permutation group algorithms / Akos Seress |
| Autore | Seress, Akos |
| Pubbl/distr/stampa | Cambridge, : Cambridge university, 2003 |
| Descrizione fisica | IX, 264 p. ; 24 cm |
| Soggetto topico |
20-XX - Group theory and generalizations [MSC 2020]
68W30 - Symbolic computation and algebraic computation [MSC 2020] 68Q25 - Analysis of algorithms and problem complexity [MSC 2020] 68W40 - Analysis of algorithms [MSC 2020] 20F05 - Generators, relations, and presentations of groups [MSC 2020] 20-08 - Computational methods for problems pertaining to group theory [MSC 2020] |
| ISBN | 978-05-216-6103-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0051399 |
|
Seress, Akos
|
||
| Cambridge, : Cambridge university, 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Permutation group algorithms / / Ákos Seress [[electronic resource]]
| Permutation group algorithms / / Ákos Seress [[electronic resource]] |
| Autore | Seress Ákos <1958-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2003 |
| Descrizione fisica | 1 online resource (ix, 264 pages) : digital, PDF file(s) |
| Disciplina | 512/.2 |
| Collana | Cambridge tracts in mathematics |
| Soggetto topico |
Permutation groups
Algorithms |
| ISBN |
1-107-12840-4
1-280-41763-3 9786610417636 1-139-14616-5 0-511-16962-0 0-511-06647-3 0-511-06016-5 0-511-30845-0 0-511-54654-8 0-511-06860-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups. |
| Record Nr. | UNINA-9910783285203321 |
|
Seress Ákos <1958->
|
||
| Cambridge : , : Cambridge University Press, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Permutation group algorithms / / Ákos Seress [[electronic resource]]
| Permutation group algorithms / / Ákos Seress [[electronic resource]] |
| Autore | Seress Ákos <1958-> |
| Pubbl/distr/stampa | Cambridge : , : Cambridge University Press, , 2003 |
| Descrizione fisica | 1 online resource (ix, 264 pages) : digital, PDF file(s) |
| Disciplina | 512/.2 |
| Collana | Cambridge tracts in mathematics |
| Soggetto topico |
Permutation groups
Algorithms |
| ISBN |
1-107-12840-4
1-280-41763-3 9786610417636 1-139-14616-5 0-511-16962-0 0-511-06647-3 0-511-06016-5 0-511-30845-0 0-511-54654-8 0-511-06860-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Black-box groups -- Permutation groups: a complexity overview -- Bases and strong generating sets -- Further low-level algorithms -- A library of nearly linear-time algorithms -- Solvable permutation groups -- Strong generating tests -- Backtrack methods -- Large-base groups. |
| Record Nr. | UNINA-9910811824603321 |
|
Seress Ákos <1958->
|
||
| Cambridge : , : Cambridge University Press, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||